907A - Masha and Bears - CodeForces Solution


brute force implementation *1300

Please click on ads to support us..

C++ Code:

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define tc ll t;cin>>t;while(t--)
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll va,vb,vc,vm;
cin>>va>>vb>>vc>>vm;
if(2*vc<vm || 2*vm<vc || vm>=va|| vm>=vb){
    cout<<-1<<endl;
}else{
    cout<<2*va<<endl;
    cout<<2*vb<<endl;
    cout<<2*min(vc,vm)<<endl;
}
return 0;
}


Comments

Submit
0 Comments
More Questions

1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts
509A - Maximum in Table
1647C - Madoka and Childish Pranks
689B - Mike and Shortcuts
379B - New Year Present
1498A - GCD Sum
1277C - As Simple as One and Two
1301A - Three Strings
460A - Vasya and Socks
1624C - Division by Two and Permutation
1288A - Deadline
1617A - Forbidden Subsequence
914A - Perfect Squares
873D - Merge Sort
1251A - Broken Keyboard
463B - Caisa and Pylons
584A - Olesya and Rodion
799A - Carrot Cakes
1569B - Chess Tournament
1047B - Cover Points
1381B - Unmerge
1256A - Payment Without Change
908B - New Year and Buggy Bot
979A - Pizza Pizza Pizza
731A - Night at the Museum